#include<bits/stdc++.h>
#define ll long long
#define mid ((l+r)>>1)
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    void pc(const char *s){
    	while(*s)putch(*s),s++;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x),putch(' '),write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
int n,m,cnt;
vector<vector<int>>a,vis;
signed main(){
	freopen("indian.in","r",stdin);
	freopen("indian.out","w",stdout);
	read(n,m);
	a.resize(n+2);
	for(int i=0;i<=n+1;i++)
		a[i].resize(m+1,0);
	vis.resize(n+2);
	for(int i=0;i<=n+1;i++)
		vis[i].resize(m+1,0);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			char ch=getch();
			while(ch!='#'&&ch!='.')ch=getch();
			a[i][j]=(ch=='#'); 
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==1&&((2*i-j-1)%5==0)){
				cnt++;
				vis[i][j]=1;
				for(int _=0;_<4;_++)
					vis[i+dx[_]][j+dy[_]]=2;
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==1){
				if(vis[i][j]!=0)continue;
				cnt++;
				vis[i][j]=1;
				for(int _=0;_<4;_++)
					vis[i+dx[_]][j+dy[_]]=2;
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==0)putch('.');
			else if(vis[i][j]==1)putch('1');
			else putch('0');
		}
		putch('\n');
	}putch('\n');
	return flush(),0;
}
